Eigenvector%2Dbased clustering using aggregated similarity matrices.

Tree Induction over Perennial Objects.

Guest editorial Special Issue %2D 13th International Conference on Natural Language and Information Systems %28NLDB 2008%29.

Density%2Dbased semi%2Dsupervised clustering.

Privacy%2Dpreserving query log mining for business confidentiality protection.

Advances in Web Mining and Web Usage Analysis

Automated Constraint Selection for Semi%2Dsupervised Clustering Algorithm.

C%2DDenStream Using Domain Knowledge on a Data Stream.

Stream Clustering of Growing Objects.

Stream Clustering of Growing Objects.

Topic Evolution in a Stream of Documents.

Topic Evolution in a Stream of Documents.

Spectral Clustering in Social%2DTagging Systems.
Social tagging is an increasingly popular phenomenon with substantial impact on the way we perceive and understand the Web. For the many Web resources that are not self-descriptive, such as images, tagging is the sole way of associating them with concepts explicitly expressed in text. Consequently, users are encouraged to assign tags to Web resources, and tag recommenders are being developed to stimulate the re-use of existing tags in a consistent way. However, a tag still and inevitably expresses the personal perspective of each user upon the tagged resource. This personal perspective should be taken into account when assessing the similarity of resources with help of tags. In this paper, we focus on similarity-based clustering of tagged items, which can support several applications in social-tagging systems, like information retrieval, providing recommendations, or the establishment of user profiles and the discovery of topics. We show that it is necessary to capture and exploit the multiple values of similarity reflected in the tags assigned to the same item by different users. We model the items, the tags on them and the users who assigned the tags in a multigraph structure. To discover clusters of similar items, we extend spectral clustering, an approach successfully used for the clustering of complex data, into a method that captures multiple values of similarity between any two items. Our experiments with two real social-tagging data sets show that our new method is superior to conventional spectral clustering that ignores the existence of multiple values of similarity among the items.
Natural Language and Information Systems
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Project Context . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2. Project Assumptions, Definitions, and Goals . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.1 Human language and our world . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.2 Human language in current methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.3 Human language as information carrier . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.4 Communication as an organisational tool . . . . . . . . . . . . . . . . . . . . . . . . . . 9 2.5 Communication as a base for information technology . . . . . . . . . . . . . . . . . . 9 2.6 Natural Language and information systems development . ...
Lifelong Knowledge Acquisition with Topic Monitoring.

Discovering Groups of Sibling Terms from Web Documents with XTREEM%2DSG.

Higher order mining.
To date, most data mining algorithms and frameworks have concentrated on the extraction of interesting rules directly from collected data. This paper investigates the generic modelling of these rules and the utility of deriving rules from the results of other data mining routines, that is, mining from rulesets (or meta-mining). It is argued that this approach has three significant advantages. Firstly, with the expansion of dataset size, the tractability of mining from the complete dataset may be difficult on a regular basis, secondly, changes in observations (and therefore in the observed system) can be more easily discovered by inspecting changes in extracted rules over time (or over any other sequential progression), and finally, the nature of the rules extracted by this process are that they contain different higher order semantics from that exhibited by first order discovery process. We argue that, in many cases, such rules are closer to the sorts of rule frequently used to describe everyd...
On exploiting the power of time in data mining.

WebKDD 2008 10 years of knowledge discovery on the web post%2Dworkshop report.

Advances in Web Mining and Web Usage Analysis





Domain Relevance on Term Weighting.

C%2DDBSCAN Density%2DBased Clustering with Constraints.

Users in Volatile Communities Studying Active Participation and Community Evolution.

DENGRAPH A Density%2Dbased Community Detection Algorithm.

Acquiring Semantic Sibling Associations from Web Documents.

Data Mining for Community Dynamics.

WebKDD%2FSNAKDD 2007 web mining and social network analysis post%2Dworkshop report.

Advances in Web Mining and Web Usage Analysis

Current Trends in Database Technology %2D EDBT 2006

From Data and Information Analysis to Knowledge Engineering

Knowledge Discovery in Databases PKDD 2006
One of the most active topics in mining of binary data is finding interesting itemsets. A traditional approach is to search for frequent itemsets. In such sets the items co-occur frequently. While this definition of importance has many nice theoretical and practical properties it has one serious drawback: A frequent itemset, say AB, is less interesting if the individual attributes A and B are frequent. On the other hand, if AB is infrequent and A and B are frequent, then the itemset AB should be interesting. One commonly used approach for defining the importance of the itemset is to compare the frequency against the independence assumption. The more the itemset deviates from the independence assumption, the more interesting it is. An alternative way of looking at this approach is to think that we are predicting the frequency an itemset from its individual attributes. In [1,2] we expand this idea by using the itemsets for the prediction. That is, we compare the itemset against a prediction based on a given family of itemsets. For prediction we use Maximum Entropy, a popular method for estimating distributions. For the comparison we use Kullback-Leibler divergence. We point out that this ranking method should be normalized and the normalization can be used as a statistical test. We tested our methods with several real-world datasets. In our experiments we found out that a surprisingly large portion of itemsets that are important according to the independence model becomes unimportant when we are using larger itemsets for the prediction. However, in some cases using less itemsets produces a better ranking. This interesting phenomenon is a type of overlearning that occurs when too many itemsets mislead the prediction and model the noise in data (see Figure 17.1). To remedy this behavior we suggest in [1] a greedy algorithm that automatically picks the lowest rank for the itemset..95 nr(G; I)
Semantics
We address the issue of semantics for an agent communication language. In particular,
Discovering Emerging Topics in Unlabelled Text Collections.

Discovering Semantic Sibling Associations from Web Documents with XTREEM%2DSP.

Discovering Semantic Sibling Groups from Web Documents with XTREEM%2DSG.

MONIC modeling and monitoring cluster transitions.
We discover communities from social network data, and analyze the community evolution. These communities are inherent characteristics of human interaction in online social networks, as well as paper citation networks. Also, communities may evolve over time, due to changes to individuals’ roles and social status in the network as well as changes to individuals ’ research interests. We present an innovative algorithm that deviates from the traditional two-step approach to analyze community evolutions. In the traditional approach, communities are first detected for each time slice, and then compared to determine correspondences. We argue that this approach is inappropriate in applications with noisy data. In this paper, we propose FacetNet for analyzing communities and their evolutions through a robust unified
Discovering Multi Terms and Co%2Dhyponymy from XHTML Documents with XTREEM.
Abstract. The Semantic Web needs ontologies as an integral component. Current methods for learning and enhancing ontologies, need to be further improved to overcome the knowledge acquisition bottleneck. The identification of concepts and relations with only minimal user interaction is still a challenging objective. Current approaches performed to extract semantics often use association rules or clustering upon regular flat text. In this paper we describe an approach on extracting semantics from Web Document collections which takes advantage of the semi structured content within XHTML (an XML dialect which can be obtained from traditional HTML documents) Web Documents. The XTREEM (Xhtml TREE Mining) method uses structural information, the mark-up in Web content, as indicators of term boundaries and for co-hyponymy relations. 1
Expanding the taxonomies of bibliographic archives with persistent long%2Dterm themes.

Mining and Visualizing the Evolution of Subgroups in Social Networks.

WebKDD 2006 web mining and web usage analysis post%2Dworkshop report.
In this report, we summarize the contents and outcomes of
Experimental Investigation of the Effects of Different Market Mechanisms for Electronic Knowledge Markets.

RELFIN %2D Topic Discovery for Ontology Enhancement and Annotation.

Evaluation of Ontology Enhancement Tools.

The Influence of Incentives and Culture on Knowledge Sharing.

WebKDD 2005 web mining and web usage analysis post%2Dworkshop report.

Web Mining From Web to Semantic Web

Deriving Multiple Topics to Label Small Document Regions.

Temporal Evolution and Local Patterns.
Abstract We elaborate on the subject of pattern change as the result of population evolution. We give an overview of literature threads relevant to this subject, whereupon the major focus of related work is on pattern adaptation rather than on modeling and understanding change. We then describe our temporal model for patterns as evolving objects and propose criteria to capture the interestingness of pattern change and heuristics that trace interesting changes. 1
Towards an Evaluation Framework for Knowledge Management Systems.

Coupling Information Extraction and Data Mining for Ontology Learning in PARMENIDES.
Strategic decision making, especially in the areas of business intelligence and competitive  intelligence, requires the acquisition of decision-relevant information pieces like market trends,  fusions and company values. This information is extracted by pre-processing and querying  multiple sources, combining and condensing the findings. It is characteristic that the extraction  process is resource intensive and has to be performed regularly and quite frequently. In  the research project PARMENIDES, we are developing methods that establish ontologies over  an application domain, annotate documents with the ontology components and identify the  entities in them, so that we can decompose business into conventional queries towards entities  and XML-annotated texts.
Overview of the ACM SIGKDD 2004 workshops.

WEBKDD 2002 %2D MiningWeb Data for Discovering Usage Patterns and Profiles
Since more and more Web sites, especially sites of retailers, offer automatic recommendation services using Web usage mining, evaluation of recommender algorithms has become increasingly important. In this paper we present a framework for the evaluation of different aspects of recommender systems based on the process of discovering knowledge in databases introduced by Fayyad et al. and we summarize research already done in this area. One aspect identified in the presented evaluation framework is widely neglected when dealing with recommender algorithms. This aspect is to evaluate how useful patterns extracted by recommender algorithms are to support the social process of recommending products to others, a process normally driven by recommendations by peers or experts. To fill this gap for recommender algorithms based on frequent itemsets extracted from usage data we evaluate the usefulness of two algorithms. The first recommender algorithm uses association rules, and the other algorithm is based on the repeat-buying theory known from marketing research. We use 6 months of usage data from an educational Internet information broker and compare useful recommendations identified by users from the target group of the broker (peers) with the recommendations produced by the algorithms. The results of the evaluation presented in this paper suggest that frequent itemsets from usage histories match the concept of useful recommendations expressed by peers with satisfactory accuracy (higher than 70%) and precision (between 60% and 90%). Also the evaluation suggests that both algorithms studied in the paper perform similar on real-world data if they are tuned properly.
Efficient Monitoring of Patterns in Data Mining Environments.

A Roadmap for Web Mining From Web to Semantic Web.

Monitoring the Evolution of Web Usage Patterns.
Abstract With the ongoing shift from off-line to on-line business processes, the Web has become an important business platform, and for most companies it is crucial to have an on-line presence which can be used to gather information about their products and/or services. However, in many cases there is a difference between the intended and the effective usage of a web site and, presently, many web site operators analyze the usage of their sites to improve their usability. But especially in the context of the Internet, content and structure change rather quickly, and the way a web site is used may change often, either due to changing information needs of its visitors, or due to an evolving user group. Therefore, the discovered usage patterns need to be updated continuously to always reflect the current state. In this article, we introduce PAM, an automated Pattern Monitor, which can be used to observe changes to the behavior of a web sites visitors. It is based on a temporal representation of rules in which both the content
Kursrelevanzprognose von Ad%2Dhoc%2DMeldungen Text Mining wider die Informations%FCberlastung im Mobile Banking.

A Framework for the Evaluation of Session Reconstruction Heuristics in Web%2DUsage Analysis.

WEBKDD 2001 %2D Mining Web Log Data Across All Customers Touch Points
 
Building and Exploiting Ad Hoc Concept Hierarchies for Web Log Analysis.
Abstract. Web usage mining aims at the discovery of interesting usage patterns from Web server log files. “Interestingness ” relates to the business goals of the site owner. However, business goals refer to business objects rather than the page hits and script invocations recorded by the site server. Hence, Web usage analysis requires a preparatory mechanism that incorporates the business goals, the concepts reflecting them and the expert’s background knowledge on them into the mining process. To this purpose, we present a methodology and a mechanism for the establishment and exploitation of application-oriented concept hierarchies in Web usage analysis. We demonstrate our approach on a real data set and show how it can substantially improve both the search for interesting patterns by the mining algorithm and the interpretation of the mining results by the analyst.
Structuring Domain%2DSpecific Text Archives by Deriving a Probabilistic XML DTD.
Abstract. Domain-specific documents often share an inherent, though undocumented structure. This structure should be made explicit to facilitate efficient, structure-based search in archives as well as information integration. Inferring a semantically structured XML DTD for an archive and subsequently transforming its texts into XML documents is a promising method to reach these objectives. Based on the KDD-driven DIAsDEM framework, we propose a new method to derive an archive-specific structured XML document type definition (DTD). Our approach utilizes association rule discovery and sequence mining techniques to structure a previously derived flat, i.e. unstructured DTD. We introduce the notion of a probabilistic DTD that is derived by discovering associations among and frequent sequences of XML tags, respectively. 1
Modelling and Incorporating Background Knowledge in the Web Mining Process.

The Impact of Site Structure and User Environment on Session Reconstruction in Web Usage Analysis.

Web Mining.

Expertenrat in E%2DMarketplaces.

A Survey of Temporal Knowledge Discovery Paradigms and Methods.
AbstractÐWith the increase in the size of data sets, data mining has recently become an important research topic and is receiving substantial interest from both academia and industry. At the same time, interest in temporal databases has been increasing and a growing number of both prototype and implemented systems are using an enhanced temporal understanding to explain aspects of behavior associated with the implicit time-varying nature of the universe. This paper investigates the confluence of these two areas, surveys the work to date, and explores the issues involved and the outstanding problems in temporal data mining. Index TermsÐTemporal data mining, time sequence mining, trend analysis, temporal rules, semantics of mined rules. 1
Employing Text Mining for Semantic Tagging in DIAsDEM.
assistant in Myra Spiliopoulou’s department and is interested in text mining, information fusion and web mining. Both public and private organizations have been accumulating large volumes of electronically available text documents for the past years. However, to turn text archives into profitable sources of knowledge, they should be transformed into an integrated and efficiently queryable information system. To attain this objective, the project DIAsDEM employs data mining techniques to derive a semantic XML DTD for a text archive and to semantically annotate its documents. In this article, we briefly describe the DIAsDEM framework for semantic tagging and its application in a case study. 1.
WEBKDD 2002 %2D Web Mining for Usage Patterns %26 Profiles.

Monitoring Change in Mining Results.

Integrating Data and Probabilistically Structured Text Documents.
Commercial, non-profit and public organizations are accumulating huge amounts of electronically available text documents. Although composed of unstructured texts, documents contained in archives such as annual reports to shareholders, medical patient records and public announcements often share an inherent, though undocumented structure. In order to enable information integration of text collections with related structured data sources, this inherent structure should be made explicit as detailed as possible. The goal of this study is the establishment of a methodology for the integration of text documents with structured records into a hyper-archive of application-specific entities. The text documents are of implicit structure which has been explicated by data mining techniques as proposed in the DIAsDEM framework for semantic tagging of domain-specific text documents. The result is a probabilistic DTD that serves as a basis for the matching of schemata and for the matching of data instances. 1
The DIAsDEM Framework for Converting Domain%2DSpecific Texts into XML Documents with Data Mining Techniques.

Data Mining for Measuring and Improving the Success of Web Sites.

Metadatabases in environmental information systems the Locator and Communication Service %28VKS%2DUmwelt%29.

Web Usage Analysis and User Profiling
Introduction Recently researchers have started to make web browsers more adaptive and personalized. A personalized web browser caters to the user&#039;s interests and an adaptive one learns from the users&#039; (potentially changing) access behavior. The goal is to help the user navigate the web. Lieberman&#039;s Letizia [13] monitors the user&#039;s browsing behavior, develops a user profile, and searches for potentially interesting pages for recommendations. The user profile is developed without intervention from the user (but the details of how that is performed is not clear in [13]). While the user is reading a page, Letizia searches, in a breadth-first manner, from that location, pages that could be of interest to the user. Pazzani et al.&#039;s Syskill &amp; Webert [18, 19] asks the user to rank pages in a specific topic. Based on the content and ratings of pages, the system learns a user profile that predicts if pages are of interest to th
Web mining for e%2Dcommerce %28workshop session %2D title only%29.

Discerning Behavioral Properties by Analyzing Transaction Logs.

An Updated Bibliography of Temporal
Mobility is the key to contemporary life. While most research activities during recent years concentrated on the representation and modeling of moving objects within GIS environments, analysis tasks have been sorely neglected, especially in the field of environmental GIS. This paper provides an overview of the sparse analysis methods available for dynamic point objects. The methods are classified in a classification cube investigating analysis properties, scopes and limitations. The methods are classified along the axes number of point objects analyzed, degree of automation in knowledge discovery and type of interaction. Further, current research objectives are reviewed and open issues highlighted.
Data Mining to Measure and Improve the Success of Web Sites

Web usage mining for Web site evaluation.

Building HyperView wrappers for publisher Web sites.
1 Introduction The number of electronic journals is rapidly increasing. Publishers currently ooeer several thousand electronic journals. For researchers, the advent of online journal editions has made life much easier since all information is reachable immediately from the own desktop. On the other hand, this huge amount of heterogeneously structured information makes conventional methods for dealing with it such as book-marking and browsing of publisher Web Sites inadequate.
WebKDD%2D99 Workshop on Web Usage Analysis and User Profiling.

WEBKDD 2000 %2D Web Mining for E%2DCommerce.

Analysis of Navigation Behaviour in Web Sites Integrating Multiple Information Systems.
Abstract. The analysis of web usage has mostly focused on sites composed of conventional static pages. However, huge amounts of information available in the web come from databases or other data collections and are presented to the users in the form of dynamically generated pages. The query interfaces of such sites allow the specification of many search criteria. Their generated results support navigation to pages of results combining cross-linked data from many sources. For the analysis of visitor navigation behaviour in such web sites, we propose the web usage miner (WUM), which discovers navigation patterns subject to advanced statistical and structural constraints. Since our objective is the discovery of interesting navigation patterns, we do not focus on accesses to individual pages. Instead, we construct conceptual hierarchies that reflect the query capabilities used in the production of those pages. Our experiments with a real web site that integrates data from multiple databases, the German SchulWeb, demonstrate the appropriateness of WUM in discovering navigation patterns and show how those discoveries can help in assessing and improving the quality of the site. Key words: Web usage mining – Data mining – Web query interfaces – Web databases – Query capabilities – Conceptual hierarchies 1
Modeling Interactions Based on Consistent Patterns.
Providers of web-based services are interested in monitoring the usage of their services in combination with those of other providers. The identification of services frequently accessed together may be valuable as a basis for strategic collaboration among their owners.
Managing Interesting Rules in Sequence Mining.
. The goal of sequence mining is the discovery of interesting sequences of events. Conventional sequence miners discover only frequent sequences, though. This limits the applicability scope of sequence mining for domains like error detection and web usage analysis. We propose a framework for discovering and maintaining interesting rules and beliefs in the context of sequence mining. We transform frequent sequences discovered by a conventional miner into sequence rules, remove redundant rules and organize the remaining ones into interestingness categories, from which unexpected rules and new beliefs are derived. 1 Introduction  Data miners pursue the discovery of new knowledge. But knowledge based solely on statistical dominance is rarely new. The expert needs means for either instructing the miner to discover only interesting rules or for ranking the mining results by &#034;interestingness&#034; [7]. Tuzhilin et al propose interestingness measures based on the notion of belief [1, 6]. A belief r...
Data Mining for the Web.
Data mining holds the key to uncovering and...
Improving the Effectiveness of a Web Site with Web Usage Mining.
Effective web presence is for many companies indispensable for their success to the global market. In recent years, several methods have been developed for measuring and improving the eoeectiveness of commercial sites. However, they mostly concentrate on web page design and on access analysis. In this study, we propose a methodology of assessing the quality of a web site in turning its users into customers. Our methodology is based on the discovery and comparison of navigation patterns of customers and non-customers. This comparison leads to rules on how the site&#039;s topology should be improved. We further propose a technique for dynamically adapting the site according to those rules.
A Bibliography of Temporal%2C Spatial and Spatio%2DTemporal Data Mining Research.
With some significant exceptions, current applications for data mining are either in those areas for which there is little accepted discovery methodology or are being used within a knowledge discovery process that does not expect authoritative results but finds the discovered rules useful none-the-less. This is in contrast to its application in the fields applicable to spatial or spatio-temporal discovery which possess a
Building HyperView Wrappers for Publisher Web%2DSites.
1 Introduction The number of electronic journals is rapidly increasing. Publishers currently ooeer several thousand electronic journals. For researchers, the advent of online journal editions has made life much easier since all information is reachable immediately from the own desktop. On the other hand, this huge amount of heterogeneously structured information makes conventional methods for dealing with it such as book-marking and browsing of publisher Web Sites inadequate.
Quality Driven Source Selection Using Data Envelope Analysis.
Due to the development of the Internet there is an increasing number of information sources available to users. This makes it necessary to query only the most appropriate sources. The information quality offered by these sources can and must be a criterion for source selection. However, information quality has many dimensions, both subjective and objective, and it is thus difficult to directly compare sources with one another or give a ranking of sources. We propose to use Data Envelopment Analysis (DEA) to solve these shortcomings. This method does not directly compare sources, but focuses on individual sources, determining their efficiency in terms of information quality and cost. We adapt DEA to the task of source selection and discuss its advantages over other methods. Furthermore, we expand the model to include cost criteria and suggest a solution to additionally select sources in a query-dependent way.
WUM %2D A Tool for WWW Ulitization Analysis.

WIND %2D A Warehouse for Internet Data.
The increasing amount of information available in the web demands sophisticated querying methods and knowledge discovery techniques. In this study, we introduce our architectural framework WIND for a data warehouse over a domain-specific thematic section of the Internet. The aim of WIND is to provide a partially materialized structured view of the underlying information sources, on which database querying can be applied and mining techniques can be developed. WIND loads web documents into several complementary local repositories like OODBMSs and text retrieval systems. This allows for a combination of attribute and content-oriented query processing. Special interest is paid to domain-specific document formats. To support conversion between (semi-)structured documents and database objects, we consider a technique for the generation of format converters based on the notion of object-grammars.
Modelling Resource Utilization in Pipelined Query Execution.
. Database parallelism offers the potential of efficient query execution, but increases the complexity of optimization, as the impact of the workload of processors and network on competing and communicating processes must be considered. We introduce a query execution model that incorporates the effects of the system workload on pipelined query execution. Our model is general enough to cover bushy and pipelined parallelism for shared-nothing and shared-disk architectures. 1 Introduction  One of the most difficult issues in database parallelism is the efficient exploitation of pipelining, because it &#034;does not easily lend itself to load balancing&#034; [3]. Many works on pipelining assume that there are no startup delays between pipeline participants. The effects of latency are simulated and extensively discussed in [6]. Pipelines with latency, termed &#034;e-steady pipelines&#034;, are modelled in [1], where the execution time of a pipeline participant is observed as a function of the number of process...
Query Optimization in Multidatabases A Calibration Mechanism Identifying the Optimization Principles of a Participant Database.

A Cost Model for the Estimation Query Execution Time in a Parallel Environment Supporting Pipeline.
We propose a model for the estimation of query execution time in an environment supporting bushy and pipelined parallelism. We consider a parallel architecture of processors having private main memories, accessing a shared secondary storage and communicating to each other via a network. For this environment, we compute the cost of query operators when processed in isolation and when in pipeline mode. We use those formulae to incrementally compute the cost of a query execution plan from its components. Our cost model can be incorporated to any optimizer for parallel query processing, that considers parallel and pipelined execution of the query operators.  Keywords: query cost estimation, query execution plan, query tree, pipeline, bushy parallelism, query optimisation, databases 1 Introduction  The development of coarse-grain parallel systems allows the implementation of parallel databases, but extends the requirements posed on the query optimiser. For example, communication overhead an...
Parallel Optimization of Large Join Queries with Set Operators and Aggregates in a Parallel Environment Supporting Pipeline.
We propose a parallel optimizer for queries containing a large number of joins, as well as set operators and aggregate  functions. The platform of execution is a shared-disk multiprocessor machine supporting bushy parallelism and pipeline. Our model  partitions the query into almost independent subtrees that can be optimized simultaneously and applies an enhanced variation of the  iterative improvement technique on those of the subtrees, which contain a large number of joins. This technique is parallelized, too.
Query Processing for Multimedia Applications on Optical Media.

Translation of SQL queries into a graph structure query transformations and pre%2Doptimization issues in a pipeline multiprocessor environment.

A Multimedia Title Development Environment %28MTDE%29.
The development of Multimedia Titles (M-Titles), i.e. multimedia applications stored on CDs, is performed by many designers and implementors using tools which run on specific platforms and often have complementary and/or overlapping functionality. The potential designer or implementor of a M-Title is restricted by the availability of tools on a selected development platform. This paper presents a Multimedia Title Development Environment (MTDE) which integrates multimedia information, tools used to produce it, as well as their formats and storage media as objects in an Asset Repository. The cooperative construction of complex multimedia objects is modelled as a DAG consisting of two types of nodes: multimedia objects and actions applied to multimedia objects. A M-Title consists of a number of complex multimedia objects linked with each other in a hypernetwork of relationships. MTDE enables a group of authors to cooperatively construct M-Titles as a hypernetwork of multimedia nodes by ac...
Parallel Optimisation of Join Queries Using an Enhanced Iterative Improvement Technique.

Using Parallelism and Pipeline for the Optimisation of Join Queries.
Abstract: In this study we present a technique for the parallel optimisation of join queries, that uses the offered coarse-grain parallelism of the underlying architecture in order to reduce the CPU-bound optimisation overhead. The optimisation technique performs an almost exhaustive search of the solution space for small join queries and gradually, as the number of joins increases, it diverges towards iterative improvement. This technique has been developed on a low-parallelism transputer-based architecture, where its behaviour is studied for the optimisation of queries with many tenths of joins. 1
Translation of SQL queries into a graph structure query transformations and pre%2Doptimization issues in a pipeline multiprocessor environment.

